Cartesian product

英 [kɑːˈtiːziən ˈprɒdʌkt]

美 [kɑːrˈtiːziən ˈprɑːdʌkt]

网络  笛卡兒積; 笛卡尔积; 笛卡儿积; 笛卡儿乘积; 笛卡尔乘积

计算机

双语例句

• The Adjacent-vertex Distinguishing Total-coloring Problem of Cartesian Product and Double Graph of Some Special Classes Graphs
  一些特殊图类的笛卡尔积和倍图的邻点可区别的全染色问题
• Restricted Edge Connectivity of Cartesian Product and Direct Product Graphs
  笛卡尔乘积图与直接乘积图的限制边连通性
• A Popularize of Venn Diagraph in Cartesian Product
  集合笛卡儿积集中文氏图的一种推广
• Adjacent vertex-distinguishing VE-total coloring of Cartesian product graph of some graphs
  部分图笛卡儿积图的邻点可区别VE-全染色
• The main results of the paper are as follows: we not only prove that the Cartesian product of graphs of path and path, path and cycle satisfies the conjecture, but also give their coloring number.
  本文的主要结果如下：我们不仅证明了路与路、路与圈的笛卡尔积图满足关联色数猜想，进而确定了它们的关联色数。
• If the number of tuples, calculated by using the Cartesian product, exceeds the set threshold; the NON EMPTY clause is applied to the query.
  如果通过使用Cartesian产品计算的元组数超过设定的阈值，将NONEMPTY子句应用于查询。
• The net result of the fake fact query subject will be to create a Cartesian Product for the dimensions, which returns in a shorter period of time.
  伪事实查询主题的第二个作用是创建维度的笛卡尔积，它能缩短时间。
• In this paper, A theorem for the binding number of multiple cartesian product of path and circuits is proven, and some limit properties of the binding number of multiple product graphs are presented.
  本文证明了路与回路的多重笛卡尔乘积的联结数的一个定理，并给出了若干多重乘积图的联结数的极限性质。
• We now derive, based on the above results, sufficient conditions for a Cartesian product network.
  我们现在得出，基于上述结果，有足够的条件，笛卡尔积网络。
• One convex set which is Cartesian product of nonregular convex polygons is used instead of the other convex set which is Cartesian product of regular polygons.
  采用不规则凸多边形的笛卡儿积构成的凸集代替正多边形的笛卡儿积构成的凸集，前者比后者更紧凑。